package leetcode.hot100;

public class Solution64 {
    /**
     * 64. 最小路径和
     * 动态规划，dp[i][j] = min(dp[i-1][j],dp[i][j-1])+grid[i][j]
     */
    public int minPathSum(int[][] grid) {
        int m = grid.length, n = grid[0].length;
        for (int i = 1; i < m; i++) {
            grid[i][0] = grid[i-1][0]+ grid[i][0];
        }
        for (int i = 1; i < n; i++) {
            grid[0][i] = grid[0][i-1]+ grid[0][i];
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                grid[i][j] = Math.min(grid[i-1][j],grid[i][j-1])+grid[i][j];
            }
        }
        return grid[m-1][n-1];
    }

}
